Addendum to "A Krylov-Schur Algorithm for Large Eigenproblems"
نویسنده
چکیده
In this addendum to an earlier paper by the author, it is shown how to compute a Krylov decomposition corresponding to an arbitrary Rayleigh-Quotient. This decomposition can be used to restart an Arnoldi process, with a selection of the Ritz vectors corresponding to the Rayleigh quotient. ABSTRACT In this addendum to an earlier paper by the author, it is shown how to compute a Krylov decomposition corresponding to an arbitrary Rayleigh-Quotient. This decomposition can be used to restart an Arnoldi process, with a selection of the Ritz vectors corresponding to the Rayleigh quotient.
منابع مشابه
A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process
We discuss a Krylov-Schur like restarting technique applied within the symplectic Lanczos algorithm for the Hamiltonian eigenvalue problem. This allows to easily implement a purging and locking strategy in order to improve the convergence properties of the symplectic Lanczos algorithm. The Krylov-Schur-like restarting is based on the SR algorithm. Some ingredients of the latter need to be adapt...
متن کاملSolving Large-scale Quadratic Eigenvalue Problems with Hamiltonian Eigenstructure Using a Structure-preserving Krylov Subspace Method
We consider the numerical solution of quadratic eigenproblems with spectra that exhibit Hamiltonian symmetry. We propose to solve such problems by applying a Krylov-Schur-type method based on the symplectic Lanczos process to a structured linearization of the quadratic matrix polynomial. In order to compute interior eigenvalues, we discuss several shift-and-invert operators with Hamiltonian str...
متن کاملRational Krylov for Large Nonlinear Eigenproblems
Rational Krylov is an extension of the Lanczos or Arnoldi eigenvalue algorithm where several shifts (matrix factorizations) are used in one run. It corresponds to multipoint moment matching in model reduction. A variant applicable to nonlinear eigenproblems is described.
متن کاملA Global Arnoldi Method for Large non-Hermitian Eigenproblems with Special Applications to Multiple Eigenproblems∗
Global projection methods have been used for solving numerous large matrix equations, but nothing has been known on if and how a global projection method can be proposed for solving large eigenproblems. In this paper, based on the global Arnoldi process that generates an Forthonormal basis of a matrix Krylov subspace, a global Arnold method is proposed for large eigenproblems. It computes certa...
متن کاملA periodic Krylov-Schur algorithm for large matrix products
Stewart’s recently introduced Krylov-Schur algorithm is a modification of the implicitly restarted Arnoldi algorithm which employs reordered Schur decompositions to perform restarts and deflations in a numerically reliable manner. This paper describes a variant of the Krylov-Schur algorithm suitable for addressing eigenvalue problems associated with products of large and sparse matrices. It per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 24 شماره
صفحات -
تاریخ انتشار 2002